International Journal of Computing and Mathematics

The shortest path problem is very crucial in large information graph computing environments and is commonly implemented in different situations. But sometimes it always involves a lot of expense to find the shortest path. So, weighing the different elements of the issues, finding the ideal route is a good decision. An enhanced A-star algorithm is suggested in this article to identify the ideal route. The a-star algorithm has two types of parameters called real cost and estimated cost, while the second algorithm plays a significant role. This paper will propose new parameters and improved heuristic function based on the traditional A-star algorithm to enhance the performance of the A-star algorithm. The simulation experiment demonstrates that the enhanced A-star algorithm works at high effectiveness compared to the traditional A-star algorithm. At the end of this document, two factors that influence the best situation are also discussed.